/LMAR=0/XLINE=3/FONT#0=BAXL30/FONT#1=BAXM30/FONT#2=BAXB30/FONT#3=SUB/FONT#4=SUP/FONT#5=BASL35/FONT#6=NGR25/FONT#7=MATH30/FONT#8=FIX25/FONT#9=GRK30/FONT#10=ZERO30/FONT#11=BAXI30/FONT#12=MS25



␈↓ ↓H␈↓␈↓ α_John␈α∞McCarthy␈α∞is␈α
Professor␈α∞of␈α∞Computer␈α
Science␈α∞at␈α∞Stanford␈α
University␈α∞and␈α∞Director␈α
of
␈↓ ↓H␈↓the␈αStanford␈α
University␈αArtificial␈αIntelligence␈α
Laboratory.␈α He␈αreceived␈α
his␈αPhD␈α
in␈αMathematics
␈↓ ↓H␈↓in␈α∞1951␈α∞from␈α∞Princeton␈α∞University␈α∞and␈α
has␈α∞taught␈α∞at␈α∞Princeton␈α∞University,␈α∞Dartmouth␈α
College,
␈↓ ↓H␈↓Massachusetts␈α
Institute␈α
of␈αTechnology␈α
and␈α
Stanford␈α
University.␈α He␈α
originated␈α
the␈αLISP␈α
language
␈↓ ↓H␈↓for␈α∞programming␈α∞with␈α∞symbolic␈α
expressions␈α∞in␈α∞1958␈α∞and␈α
started␈α∞the␈α∞first␈α∞work␈α∞on␈α
time-sharing
␈↓ ↓H␈↓computer␈α∀systems␈α∀at␈α∀M.I.T.␈α∪in␈α∀1959.␈α∀ His␈α∀main␈α∪scientific␈α∀interests␈α∀are␈α∀artificial␈α∪intelligence,
␈↓ ↓H␈↓mathematical␈αtheory␈αof␈α
computation␈αand␈αrecently␈α
computer␈αcommunication.␈α He␈α
can␈αlecture␈αon␈α
the
␈↓ ↓H␈↓following topics:

␈↓ ↓H␈↓␈↓ α_Representation of Recursive Programs in First Order Logic

␈↓ ↓H␈↓␈↓ α_Recursive␈αprograms␈αwritten␈αin␈αLISP␈αstyle␈αcan␈αbe␈αreplaced␈αby␈αa␈αfunctional␈αequation␈αin␈αfirst
␈↓ ↓H␈↓order␈α
logic␈αand␈α
an␈α
axiom␈αschema␈α
expressing␈α
the␈αfact␈α
that␈α
the␈αrecursion␈α
gives␈α
the␈αminimal␈α
solution
␈↓ ↓H␈↓of␈α⊃the␈α∩functional␈α⊃equation.␈α∩ This␈α⊃represntation␈α∩provides␈α⊃a␈α∩convenient␈α⊃formalism␈α∩for␈α⊃proving
␈↓ ↓H␈↓properties of programs.

␈↓ ↓H␈↓␈↓ α_Epistemological Problems of Artificial Intelligence

␈↓ ↓H␈↓␈↓ α_Programs␈αwith␈αgeneral␈αcommon␈αsense␈αintelligence␈αrequire␈αa␈αway␈αof␈αrepresenting␈αfacts␈αabout
␈↓ ↓H␈↓the␈α
world␈α
and␈αthe␈α
general␈α
facts␈αabout␈α
the␈α
effects␈αof␈α
actions,␈α
about␈αknowledge,␈α
and␈α
about␈αgoals␈α
and
␈↓ ↓H␈↓subgoals.␈α Valid␈αand␈αconjectural␈αmodes␈αof␈αreasoning␈αmust␈αalso␈αbe␈αspecified.␈α What␈αthese␈αfacts␈αare
␈↓ ↓H␈↓and␈α
how␈α
to␈αrepresent␈α
them␈α
can␈α
advantageously␈αbe␈α
studied␈α
apart␈α
from␈αthe␈α
programs␈α
that␈αuse␈α
them.
␈↓ ↓H␈↓These␈α∞epistemological␈α∞problems␈α∞of␈α∞artificial␈α∞intelligence␈α∞are␈α∞related␈α∞to␈α∞␈↓↓philosophical␈α∂logic␈↓.␈α∞ Some
␈↓ ↓H␈↓results␈αwill␈αbe␈αreported␈αabout␈αhow␈αto␈α
represent␈αfacts␈αabout␈αknowledge␈αand␈αa␈αnew␈α
conjectural␈αbut
␈↓ ↓H␈↓formal mode of reasoning will be described.

␈↓ ↓H␈↓␈↓ α_Dialnet

␈↓ ↓H␈↓␈↓ α_Stanford␈α∩University␈α∩is␈α∩developing␈α∩a␈α∩set␈α∩of␈α∩protocols␈α∩for␈α∩communication␈α∩between␈α∩time-
␈↓ ↓H␈↓sharing␈α∩systems␈α∩using␈α∩the␈α∩dial-up␈α∪telephone␈α∩network.␈α∩ Users␈α∩of␈α∩computers␈α∪implementing␈α∩the
␈↓ ↓H␈↓Dialnet␈α∞protocols␈α∞can␈α∞send␈α∞messages␈α∞to␈α∞users␈α∞of␈α∞any␈α∞other␈α∞computer␈α∞in␈α∞the␈α∂world␈α∞implementing
␈↓ ↓H␈↓these␈α
protocols,␈α∞can␈α
transmit␈α∞files␈α
of␈α∞programs,␈α
data␈α∞and␈α
reports,␈α∞and␈α
can␈α∞use␈α
their␈α∞terminals␈α
as
␈↓ ↓H␈↓though␈αthey␈αwere␈αterminals␈αon␈αother␈αcomputers.␈α The␈αpresent␈αstate␈αof␈αthe␈αDialnet␈αProject␈α
will␈αbe
␈↓ ↓H␈↓described.

␈↓ ↓H␈↓␈↓ α_Low Overhead Time-sharing

␈↓ ↓H␈↓␈↓ α_Stanford␈α
University␈αhas␈α
recently␈α
instituted␈αa␈α
time-sharing␈α
service␈αfor␈α
student␈α
use.␈α Based␈α
on
␈↓ ↓H␈↓a␈αDigital␈αEquipment␈α
2050␈αcomputer,␈α80␈α
terminals␈αare␈αavailable␈αin␈α
two␈αterminals␈αrooms␈α
and␈αover
␈↓ ↓H␈↓telephone lines.  2500 to 3000 students are supported with a total staff of four people.